// TODO: 还不是很懂

/**
 * @file acwing/97/main.cpp
 * @author Ruiming Guo (guoruiming@stu.scu.edu.cn)
 * @brief 给定两个整数 A 和 B（不同时为0），S 是 A ** B 的所有约数之和，
 * 求 S mod 9901
 * @version 1.0
 * @date 2022-05-03
 *
 * @copyright Copyright (c) 2022
 *
 **/
#include <cstdio>
using namespace std;
const int mod = 9901;
typedef long long ll;
ll qexp(ll a, ll b) {
  int res = 1;
  while (b) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return res;
}

/**
 * @brief 计算 $\sum_{i=0}^{k-1} q^i$
 **/
ll sum(ll p, int k) {
  if (k == 1) return 1;
  if (k & 1) return (qexp(p, k - 1) + sum(p, k - 1)) % mod;
  return (1 + qexp(p, k / 2)) * sum(p, k / 2) % mod;
}

int main() {
  int a, b;
  scanf("%d%d", &a, &b);
  ll res = 1;
  for (int i = 2; i <= a / i; ++i) {
    if (a % i == 0) {
      int s = 0;
      while (a % i == 0) a /= i, ++s;
      res = res * sum(i, b * s + 1) % mod;
    }
  }
  if (a > 1) res = res * sum(a, b + 1) % mod;
  if (a == 0) res = 0;
  printf("%d\n", res);
  return 0;
}
